Optimizing spread dynamics on graphs by message passing
نویسندگان
چکیده
منابع مشابه
Optimizing spread dynamics on graphs by message passing
Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been succesfully applied to describe cascades in a large variety of contexts. Over the last decades, many efforts have been devoted to understand the typical behaviour of the casca...
متن کاملMAP Estimation, Message Passing, and Perfect Graphs
Efficiently finding the maximum a posteriori (MAP) configuration of a graphical model is an important problem which is often implemented using message passing algorithms. The optimality of such algorithms is only well established for singly-connected graphs and other limited settings. This article extends the set of graphs where MAP estimation is in P and where message passing recovers the exac...
متن کاملDiscrete geometric analysis of message passing algorithm on graphs
We often encounter probability distributions given as unnormalized products of non-negative functions. The factorization structures of the probability distributions are represented by hypergraphs called factor graphs. Such distributions appear in various fields, including statistics, artificial intelligence, statistical physics, error correcting codes, etc. Given such a distribution, computatio...
متن کاملA Message Passing Model for Communication on Random Regular Graphs
| Randomized routing strategies are applied to avoid worst-case communication patterns on communication networks used for parallel computers. Instead of a randomized routing strategy on a regular communication network, the random-ization of the network itself is investigated in this paper. A model to describe properties of random regular graphs is presented. With the results of the model it is ...
متن کاملPartition Function Expansion on Region-Graphs and Message-Passing Equations
Disordered and frustrated graphical systems are ubiquitous in physics, biology, and information science. For models on complete graphs or random graphs, deep understanding has been achieved through the mean-field replica and cavity methods. But finite-dimensional ‘real’ systems persist to be very challenging because of the abundance of short loops and strong local correlations. A statistical me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2013
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2013/09/p09011